Maximal and minimal balls
نویسندگان
چکیده
منابع مشابه
MAXIMAL ALLOCATED BENEFIT AND MINIMAL ALLOCATED COST AND ITS APPLICATION
In this paper, we investigate the problems of consensus-making among institution in stock exchange with multiple criteria for evaluating performance when the players (institutions) are supposed to be egoistic and the score for each criterion for a player is supposed to be a positive score. Each player sticks to his superiority regarding the criteria. This paper introduces the models for computi...
متن کاملMaximal and Minimal Topologieso
A topological space (X, T) with property R is maximal R (minimal R) if T is a maximal (minimal) element in the set R(X) of all topologies on the set X having property R with the partial ordering of set inclusions. The properties of maximal topologies for compactness, countable compactness, sequential compactness, Bolzano-Weierstrass compactness, and Lindelöf are investigated and the relations b...
متن کاملOn Maximal Balls in Three Volume Grids
A volume image can be digitized in different grids, not only the cubic one. The fcc and bcc grids have many advantages, as they are more dense than the cubic one. The set of maximal balls in a shape in a volume image is a compact but complete description of the shape. The original set, identified by rules dependent on the metric used, can be further reduced, by observing that some balls are cov...
متن کاملMaximal and Minimal Solutions to Language Equations
Given two languages L1 , L2 7*, we define L1hL2= [uhv | u # L1 , v # L2]. The well-known operations of catenation, right left quotient and shuffle product are examples of such operations. Other examples include the insertion and deletion operations. Recall that (see [3, 4]) given words u, v # 7*, the insertion of v into u is u v= [u1vu2 | u=u1u2] and the deletion of v from u is defined as u v=[...
متن کاملMaximal and Minimal Vertex - critical Graphsof Diameter
A graph is vertex-critical (edge-critical) if deleting any vertex (edge) increases its diameter. A conjecture of Simon and Murty stated thatèvery edge-critical graph of diameter two on vertices contains at most 1 4 2 edges'. This conjecture has been established for suuciently large. For vertex-critical graphs, little is known about the number of edges. Plesn ik implicitly asked whether it is al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 1993
ISSN: 0925-7721
DOI: 10.1016/0925-7721(93)90017-z